Merge as a Lattice-Join of XML Documents
نویسندگان
چکیده
We explore theoretical foundations of the Merge operation. Merge functions as a kind of “recursive union” over similarly structured XML documents to produce a new XML document, and can be used for creating aggregates over streams of XML fragments. We describe the Merge operation and show that Merge is in fact the join operation of an upper semi-lattice of conformant documents. Our work relies on a representation of unordered XML documents as sets of attributed paths. We have found this representation useful for comparing the information content of documents, and determining when a given document satisfies certain key-like constraints.
منابع مشابه
Structural Join Algorithm for Sequential Regular Path Expressions
XML queries employ regular path expressions to find structural patterns within XML documents. The operation of structural join is a crucial part of XML query processing. Existing approaches reduce complex join expressions to several binary structural joins. It implies generation of superfluous intermediate data. In this paper, we propose a new structural join algorithm, called sequence join alg...
متن کاملTowards Cost-based Optimizations of Twig Content-based Queries
In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for this purpose. Some effort has been expended in the optimization of XML query processing [20]. There are not many works that take cost-based query optimizations into account. In work [20], we find some cost-based considerations,...
متن کاملSecuring XML Query Processing Storage
The effective processing of semi-structured data queries is a preliminary part of data mining stage. XML queries employ regular path expressions to find structural patterns within XML documents. The operation of structural join is a crucial part of XML query processing. Existing approaches reduce complex join expressions to several binary structural joins. In this paper, we are proposing a new ...
متن کاملStructural Joins: a Primitive for Eecient Xml Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some speciied tree structured relationships. The primitive tree structured relationships are parent-child and ancestor-descendant, and nding all occurrences of these structural relationships in an XML database is a core operation for XML query processing. In this paper, we develop two families of struc...
متن کاملخوشهبندی فراابتکاری اسناد فارسی اِکس‌اِم‌اِل مبتنی بر شباهت ساختاری و محتوایی
Due to the increasing number of documents, XML, effectively organize these documents in order to retrieve useful information from them is essential. A possible solution is performed on the clustering of XML documents in order to discover knowledge. Clustering XML documents is a key issue of how to measure the similarity between XML documents. Conventional clustering of text documents using a do...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002